Termination w.r.t. Q of the following Term Rewriting System could be proven:
Q restricted rewrite system:
The TRS R consists of the following rules:
f(a, x) → g(a, x)
g(a, x) → f(b, x)
f(a, x) → f(b, x)
Q is empty.
↳ QTRS
↳ DependencyPairsProof
Q restricted rewrite system:
The TRS R consists of the following rules:
f(a, x) → g(a, x)
g(a, x) → f(b, x)
f(a, x) → f(b, x)
Q is empty.
Using Dependency Pairs [1,15] we result in the following initial DP problem:
Q DP problem:
The TRS P consists of the following rules:
G(a, x) → F(b, x)
F(a, x) → G(a, x)
F(a, x) → F(b, x)
The TRS R consists of the following rules:
f(a, x) → g(a, x)
g(a, x) → f(b, x)
f(a, x) → f(b, x)
Q is empty.
We have to consider all minimal (P,Q,R)-chains.
↳ QTRS
↳ DependencyPairsProof
↳ QDP
↳ DependencyGraphProof
Q DP problem:
The TRS P consists of the following rules:
G(a, x) → F(b, x)
F(a, x) → G(a, x)
F(a, x) → F(b, x)
The TRS R consists of the following rules:
f(a, x) → g(a, x)
g(a, x) → f(b, x)
f(a, x) → f(b, x)
Q is empty.
We have to consider all minimal (P,Q,R)-chains.
The approximation of the Dependency Graph [15,17,22] contains 0 SCCs with 3 less nodes.